A Parrondo Paradox in Reliability Theory

نویسنده

  • Antonio Di Crescenzo
چکیده

Parrondo’s paradox arises in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. We present a suitable version of Parrondo’s paradox in reliability theory involving two systems in series, the units of the first system being less reliable than those of the second. If the first system is modified so that the distributions of its new units are mixtures of the previous distributions with equal probabilities, then under suitable conditions the new system is shown to be more reliable than the second in the “usual stochastic order” sense.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information Entropy and Parrondo's Discrete-Time Ratchet

Parrondo's paradox involves two losing games of chance. The paradox is that a winning situation is produced when the two games are played in a random sequence in accordance with fixed probabilities. In this paper we investigate the relationship between these parameters and the entropy rates of the games.

متن کامل

Quantum Parrondo’s Games

Parrondo’s Paradox arises when two losing games are combined to produce a winning one. A history dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by general SU(2) operators to transform the game into the quantum domain. In the initial state a superposition of qubits can be used to couple the games and produce...

متن کامل

Parrondo-like behavior in continuous-time random walks with memory.

The continuous-time random walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this paper we will show how the random combination of two different unbiased CTRWs can give rise to a process with clear drift, if one of them is a CTRW with memory. If one identifies the other one as noise, the effect can be thought of as a kind of stochastic resonance. The ultimat...

متن کامل

Inefficiency of voting in Parrondo games

We study a modification of the so-called Parrondo’s paradox where a large number of individuals choose the game they want to play by voting. We show that it can be better for the players to vote randomly than to vote according to their own benefit in one turn. The former yields a winning tendency while the latter results in steady losses. An explanation of this behaviour is given by noting that...

متن کامل

Parrondo’s Capital and History Dependent Games

It has been shown that it is possible to construct two games that when played individually lose, but alternating randomly or deterministically between them can win. This apparent paradox has been dubbed “Parrondo’s paradox.” The original games are capital dependent, which means that the winning and losing probabilities depend on how much capital the player currently has. Recently, new games hav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008